Symbolic model checking for agent interactions
نویسندگان
چکیده
In this paper, we address the issue of the specification and verification of commitment protocols having a social semantics. We begin with developing a new language to formally specify these protocols and desirable properties by enhancing CTL∗ logic with modalities of commitments and actions on these commitments. We also present a symbolic model checking algorithm for commitments and their actions based on OBDDs. Finally, we present an implementation and experimental results of the proposed protocol using the NuSMV and MCMAS symbolic model checkers.
منابع مشابه
Symbolic Model Checking Commitment Protocols Using Reduction
Using model checking to verify that interaction protocols have given properties is widely recognized as an important issue in multiagent systems where autonomous and heterogeneous agents need to successfully regulate and coordinate their interactions. In this paper, we investigate the use of symbolic model checkers to verify the compliance of a special kind of interaction protocols called commi...
متن کاملApplications of Fuzzy Program Graph in Symbolic Checking of Fuzzy Flip-Flops
All practical digital circuits are usually a mixture of combinational and sequential logic. Flip–flops are essential to sequential logic therefore fuzzy flip–flops are considered to be among the most essential topics of fuzzy digital circuit. The concept of fuzzy digital circuit is among the most interesting applications of fuzzy sets and logic due to the fact that if there has to be an ultimat...
متن کاملThe complexity of symbolic model checking temporal-epistemic logics
This paper presents complexity results for symbolic model checking for CTLK, a logic to reason about time and knowledge in multi-agent systems. We apply these results to investigate the complexity of verifying concurrent programs.
متن کاملSymbolic Model Checking for Multi-Agent Systems
Multi-Agent Systems are increasingly complex, and the problem of their verification and validation is acquiring increasing importance. In this paper we show how a well known and effective verification technique, symbolic model checking, can be generalized to deal with Multi-Agent Systems. Our approach is fully amenable to the reuse of data structures used in symbolic model checking, Binary Deci...
متن کامل